Improving the Efficiency of Parsing Discontinuous Constituents
نویسنده
چکیده
A prominent tradition within the framework of Head-Driven Phrase Structure Grammar (HPSG, Pollard and Sag 1994) has argued on linguistic grounds for analyses which license so-called discontinuous constituents (Reape 1993; Kathol 1995; Richter and Sailer 2001; Müller 1999a; Penn 1999; Donohue and Sag 1999; Bonami et al. 1999), joining researchers in other linguistic frameworks, including Dependency Grammar (Bröker 1998; Plátek et al. 2001), Tree Adjoining grammar (Kroch and Joshi 1987; Rambow and Joshi 1994), Categorial Grammar (Dowty 1996; Hepple 1994; Morrill 1995), and those positing tangled trees (McCawley 1982; Huck 1985; Ojeda 1987; Blevins 1990) in rejecting string concatenation as the fundamental mode of constituent combination. 1
منابع مشابه
Improving the Efficiency of Parsing with Discontinuous Constituents
We discuss a generalization of Earley’s algorithm to grammars licensing discontinuous constituents of the kind proposed by the socalled linearization approaches in Head-Driven Phrase Structure Grammar. We show how to replace the standard indexing on the string position by bitmasks that act as constraints over possible coverage bitvectors. This improves efficiency of edge access and reduces the ...
متن کاملParsing with Discontinuous Constituents
By generalizing the notion of location of a constituent to allow discontinuous Ioctaions, one can describe the discontinuous constituents of non-configurational languages. These discontinuous constituents can be described by a variant of definite clause grammars, and these grammars can be used in conjunction with a proof procedure to create a parser for non-configurational languages.
متن کاملParsing String Generating Hypergraph Grammars
A string generating hypergraph grammar is a hyperedge replacement grammar where the resulting language consists of string graphs i.e. hypergraphs modeling strings. With the help of these grammars, string languages like anbncn can be modeled that can not be generated by context-free grammars for strings. They are well suited to model discontinuous constituents in natural languages, i.e. constitu...
متن کاملDiscontinuous Incremental Shift-reduce Parsing
We present an extension to incremental shift-reduce parsing that handles discontinuous constituents, using a linear classifier and beam search. We achieve very high parsing speeds (up to 640 sent./sec.) and accurate results (up to 79.52 F1 on TiGer).
متن کاملIncorporating Semi-supervised Features into Discontinuous Easy-First Constituent Parsing
This paper describes adaptations for EAFI, a parser for easy-first parsing of discontinuous constituents, to adapt it to multiple languages as well as make use of the unlabeled data that was provided as part of the SPMRL shared task 2014.
متن کامل